Sweeping Preconditioner for the Helmholtz Equation: Hierarchical Matrix Representation
نویسندگان
چکیده
The paper introduces the sweeping preconditioner, which is highly efficient for iterative solutions of the variable-coefficient Helmholtz equation including veryhigh-frequency problems. The first central idea of this novel approach is to construct an approximate factorization of the discretized Helmholtz equation by sweeping the domain layer by layer, starting from an absorbing layer or boundary condition. Given this specific order of factorization, the second central idea is to represent the intermediate matrices in the hierarchical matrix framework. In two dimensions, both the construction and the application of the preconditioners are of linear complexity. The generalized minimal residual method (GMRES) solver with the resulting preconditioner converges in an amazingly small number of iterations, which is essentially independent of the number of unknowns. This approach is also extended to the three-dimensional case with some success. Numerical results are provided in both two and three dimensions to demonstrate the efficiency of this new approach. © 2011 Wiley Periodicals, Inc.
منابع مشابه
Sweeping Preconditioner for the 3 D 1 Helmholtz Equation
This paper introduces the recursive sweeping preconditioner for the numerical solu4 tion of the Helmholtz equation in 3D. This is based on the earlier work of the sweeping preconditioner 5 with the moving perfectly matched layers (PMLs). The key idea is to apply the sweeping precondi6 tioner recursively to the quasi-2D auxiliary problems introduced in the 3D sweeping preconditioner. 7 Compared ...
متن کاملRecursive Sweeping Preconditioner for the Three-Dimensional Helmholtz Equation
This paper introduces the recursive sweeping preconditioner for the numerical solution of the Helmholtz equation in three dimensions. This is based on the earlier work of the sweeping preconditioner with the moving perfectly matched layers. The key idea is to apply the sweeping preconditioner recursively to the quasi-two-dimensional auxiliary problems introduced in the three-dimensional (3D) sw...
متن کاملSparsify and sweep: an efficient preconditioner for the Lippmann-Schwinger equation
This paper presents an efficient preconditioner for the Lippmann-Schwinger equation that combines the ideas of the sparsifying and the sweeping preconditioners. Following first the idea of the sparsifying preconditioner, this new preconditioner starts by transforming the dense linear system of the Lippmann-Schwinger equation into a nearly sparse system. The key novelty is a newly designed perfe...
متن کاملSweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate LDLt factorization by eliminating the unknowns layer by layer starting from an absorbing layer or boundary condition. The central idea of this paper is to approximate ...
متن کاملA convergence analysis for a sweeping preconditioner for block tridiagonal systems of linear equations
We study sweeping preconditioners for symmetric and positive definite block tridiagonal systems of linear equations. The algorithm provides an approximate inverse that can be used directly or in a preconditioned iterative scheme. These algorithms are based on replacing the Schur complements appearing in a block Gaussian elimination direct solve by hierarchical matrix approximations with reduced...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011